A20 - LCS

提出

code: python

s = input()

t = input()

# dpij :=

解答

code: python

s = input()

t = input()

dp = [None * (len(t) + 1) for i in range(len(s) + 1)]

dp00 = 0

for i in range(0, len(s)+1):

for j in range(0, len(t)+1):

if i >= 1 and j >= 1 and si-1 == tj-1:

dpij = max(dpi-1j, dpij-1, dpi-1j-1+1)

elif i >= 1 and j >= 1:

dpij = max(dpi-1j, dpij-1)

elif i >= 1:

dpij = dpi-1j

elif j >= 1:

dpij = dpij-1